Effective Ad Hoc Social Networking on OLSR MANET Using Similarity of Interest Approach

Recently, social networking over MANETs has attracted the attention of research community, due to its flexibility, cost saving and infrastructure-less architecture. However, various problems namely, to efficiently find nodes of similar interest and network partition, exist in such environment. For enabling ad hoc social networking in an intermittent network scenario, Delay Tolerant Network (DTN) emerges as one of the solution. This paper proposes a novel algorithm allowing users to find friends of similar interest both in their neighborhood and in entire network by using DTN on OLSR MANET. We investigate and compare the similarity of users interest using four similarity metrics: Cosine Similarity, Jaccard, Correlation and Dice Coefficient. We simulate the algorithms assuming that users change their interest at fixed and random time (normal and uniform distribution). The simulations results show that Cosine Similarity provides the highest number of similar interest matching. In addition, by implementing the proposed algorithm on DTN with the normal distributed users interest-changing time, the success ratio of finding matches increases significantly.